Distributed (Δ+1)-coloring in the physical model
نویسندگان
چکیده
منابع مشابه
Distributed (Δ + 1)-Coloring in the Physical Model
Article history: Received 3 February 2012 Received in revised form 6 April 2014 Accepted 22 May 2014 Available online xxxx
متن کاملOn Greedy Graph Coloring in the Distributed Model
In the paper we consider distributed algorithms for greedy graph coloring. For the largest-first (LF) approach, we propose a new distributed algorithm which is shown to color a graph in an expected time of O(∆ log n log∆) rounds, and we prove that any distributed LF-coloring algorithm requires at least Ω(∆) rounds. We discuss the quality of obtained colorings in the general case and for particu...
متن کاملSimple Distributed Delta + 1 Coloring in the SINR Model
In wireless ad hoc or sensor networks, distributed node coloring is a fundamental problem closely related to establishing efficient communication through TDMA schedules. For networks with maximum degree ∆, a ∆ + 1 coloring is the ultimate goal in the distributed setting as this is always possible. In this work we propose ∆ + 1 coloring algorithms for the synchronous and asynchronous setting. Al...
متن کاملSimple Distributed Δ + 1 Coloring in the SINR Model
In wireless ad hoc networks, distributed node coloring is a fundamental problem closely related to establishing efficient communication through TDMA schedules. For networks with maximum degree ∆, a ∆+ 1 coloring is the ultimate goal in the distributed setting as this is always possible. In this work we propose a very simple 4∆ coloring along with a color reduction technique to achieve ∆+ 1 colo...
متن کاملImproved Distributed $\Delta$-Coloring
We present a randomized distributed algorithm that computes a ∆-coloring in any noncomplete graph with maximum degree ∆ ≥ 4 in O(log∆) + 2 √ log logn) rounds, as well as a randomized algorithm that computes a ∆-coloring in O((log logn)) rounds when ∆ ∈ [3, O(1)]. Both these algorithms improve on an O(log n/ log∆)-round algorithm of Panconesi and Srinivasan [STOC’1993], which has remained the st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.05.016